exact age - vertaling naar russisch
Diclib.com
Woordenboek ChatGPT
Voer een woord of zin in in een taal naar keuze 👆
Taal:

Vertaling en analyse van woorden door kunstmatige intelligentie ChatGPT

Op deze pagina kunt u een gedetailleerde analyse krijgen van een woord of zin, geproduceerd met behulp van de beste kunstmatige intelligentietechnologie tot nu toe:

  • hoe het woord wordt gebruikt
  • gebruiksfrequentie
  • het wordt vaker gebruikt in mondelinge of schriftelijke toespraken
  • opties voor woordvertaling
  • Gebruiksvoorbeelden (meerdere zinnen met vertaling)
  • etymologie

exact age - vertaling naar russisch

DISJOINT FAMILY OF SETS, DRAWN FROM A LARGER COLLECTION, WITH THE SAME UNION AS THE WHOLE COLLECTION
Exact cover problem; Exact Cover; Exact hitting set
  • 300px
  • 300px

exact age      
точный возраст
exact sciences         
SCIENCES THAT ADMIT OF ABSOLUTE PRECISION IN THEIR RESULTS
Exact mathematical sciences; Exact Sciences; Exact Science; Quantitative sciences; Quantitative science; Exact science

[ig'zækt'saiənsiz]

общая лексика

точные науки

exact sciences         
SCIENCES THAT ADMIT OF ABSOLUTE PRECISION IN THEIR RESULTS
Exact mathematical sciences; Exact Sciences; Exact Science; Quantitative sciences; Quantitative science; Exact science
exact sciences точные науки

Definitie

Нью эйдж
("Нью эйдж")

индийский еженедельник, ЦО Коммунистической партии Индии (КПИ). Основан в 1953. Издаётся на английском языке в Дели.

Лит.: Круглов Е. В., Коммунистическая печать Индии, М., 1966.

Wikipedia

Exact cover

In the mathematical field of combinatorics, given a collection S of subsets of a set X, an exact cover is a subcollection S* of S such that each element in X is contained in exactly one subset in S*. In other words, S* is a partition of X consisting of subsets contained in S. One says that each element in X is covered by exactly one subset in S*. An exact cover is a kind of cover.

In computer science, the exact cover problem is a decision problem to determine if an exact cover exists. The exact cover problem is NP-complete and is one of Karp's 21 NP-complete problems. It is NP-complete even when each subset in S contains exactly three elements; this restricted problem is known as exact cover by 3-sets, often abbreviated X3C. The exact cover problem is a kind of constraint satisfaction problem.

An exact cover problem can be represented by an incidence matrix or a bipartite graph.

Knuth's Algorithm X is an algorithm that finds all solutions to an exact cover problem. DLX is the name given to Algorithm X when it is implemented efficiently using Donald Knuth's Dancing Links technique on a computer.

The standard exact cover problem can be generalized slightly to involve not only "exactly one" constraints but also "at-most-one" constraints.

Finding Pentomino tilings and solving Sudoku are noteworthy examples of exact cover problems. The n queens problem is a slightly generalized exact cover problem.

Voorbeelden uit tekstcorpus voor exact age
1. His exact age, however, was not immediately known.
2. King Fahd‘s exact age is unknown, but he was believed to be between 82 and 84.
3. Guler said Samast was born in 1''0, but did not release his exact age.
4. His exact age was unknown, but he was believed to be between 82 and 84.
5. His exact age remains uncertain –– believed to be between 82 and 84.
Vertaling van &#39exact age&#39 naar Russisch